Subsumption Algorithms for Concept Description Languages

We investigate subsumption algorithms for logic-based knowledge representation languages of the kl-one family. We deene an attribu-tive concept description language that contains the logical connectives conjunction, disjunction, and negation, as well as role quantiication, number restrictions and role intersection. We describe a rule based calculus to decide subsumption in this language, that closely resembles the tableaux calculus of rst order predicate logic. Furthermore, we give polynomial space algorithms for certain sublanguages.